Boolean embedding from a partially ordered structure to a boolean algebra
نویسندگان
چکیده
منابع مشابه
Boolean algebras over partially ordered sets
Being the crossroads between Algebra, Topology, Logic, Set Theory and the Theory of Order; the class of Boolean algebras over partially ordered sets were look at as one of the sources, providing over time, new insights in Boolean algebras. Some constructions and their interconnections will be discussed, motivating along the way a list of open problems. Mathematics Subject Classification (MSC 20...
متن کاملPseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Sta...
متن کاملBoolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کاملThe Hodge Structure on a Filtered Boolean Algebra
Let (Bn) be the order complex of the Boolean algebra and let B(n, k) be the part of (Bn) where all chains have a gap at most k between each set. We give an action of the symmetric group Sl on the l-chains that gives B(n, k) a Hodge structure and decomposes the homology under the action of the Eulerian idempontents. The Sn action on the chains induces an action on the Hodge pieces and we derive ...
متن کامل132 Pre - Boolean Algebra , Ordered Dsmt and Dsm Continuous Models
When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyper-power sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this chapter, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their resulting log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 1999
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207169908804810